Convergent transfer schemes for $N$-person games
نویسندگان
چکیده
منابع مشابه
A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کاملEquilibrium Points in N - Person Games
* This note arose from consultations during the tenure of a John Simon Guggenheim Memorial Fellowship by MacLane. ' Whitehead, J. H. C., "Combinatorial Homotopy I and II," Bull. A.M.S., 55, 214-245 and 453-496 (1949). We refer to these papers as CH I and CH II, respectively. ' By a complex we shall mean a connected CW complex, as defined in §5 of CH I. We do not restrict ourselres to finite com...
متن کاملAn Algorithmic Solution of N-Person Games
function is a function which estimates what resulting value Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person games and proposes a procedure for constant sum or non-constant sum games. It is proved that a procedure, max”, locates an equilibrium point given the entire game tree. The minimax procedur...
متن کاملEquilibrium Points in N-Person Games.
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملLearning through reinforcement for N-person repeated constrained games
The design and analysis of an adaptive strategy for N-person averaged constrained stochastic repeated game are addressed. Each player is modeled by a stochastic variable-structure learning automaton. Some constraints are imposed on some functions of the probabilities governing the selection of the player's actions. After each stage, the payoff to each player as well as the constraints are rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1968
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1968-0230550-9